The Complexity of MaxMin Length Triangulation
نویسنده
چکیده
In 1991, Edelsbrunner and Tan gave an O(n) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NPcomplete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the problem within any polynomial factor.
منابع مشابه
New Results on Optimal Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...
متن کاملQuadratic Time Computable Instances of Maxmin and Minmax Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic program...
متن کاملAn algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest area triangle in the triangulation. There exists a dynamic programming algorithm that computes ...
متن کاملAlgorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملApproximating the Maxmin-angle Covering Triangulation
Given a planar straight line graph we seek a covering triangulation whose minimumangle is as large as possible A covering triangulation is a Steiner triangulation with the following restriction No Steiner vertices may be added on an input edge We give an explicit upper bound on the largest possible minimum angle in any covering triangulation of a given input This upper bound depends only on loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1208.0202 شماره
صفحات -
تاریخ انتشار 2012